package com.example.system.class11;

/**
 * @Date 2022/7/30
 * @Author Jonathan
 * @Description 递归遍历二叉树
 */
public class Code01_RecursiveTraversalBT {

    static class Node {
        Node left;
        Node right;
        int value;
    }

    public static void f(Node cur) {
        if (cur == null) {
            return;
        }
        // 先序
        f(cur.left);
        // 中序
        f(cur.right);
        // 后序
    }
}
